Minimax principle and lower bounds in H2-rational approximation
نویسندگان
چکیده
We derive lower bounds in rational approximation of given degree to functions in the Hardy space H2 of the unit disk. We apply these to asymptotic error rates in rational approximation to Blaschke products and to Cauchy integrals on geodesic arcs. We also explain how to compute such bounds, either using Adamjan–Arov–Krein theory or linearized errors, and we present a couple of numerical experiments. We dwell on a maximin principle developed in Baratchart and Seyfert (2002). c ⃝ 2015 Elsevier Inc. All rights reserved. MSC: 31B05; 35J25; 42B35; 46E20; 47B35
منابع مشابه
Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle
Minimax Weighted Constraint Satisfaction Problems (formerly called QWCSPs) are a framework for modeling soft constrained problems with adversarial conditions. In this paper, we describe novel definitions and implementations of node, arc and full directional arc consistency notions to help reduce search space on top of the basic tree search with alpha-beta pruning for solving ultraweak solutions...
متن کاملH2-optimal Approximation of Mimo Linear Dynamical Systems
We consider the problem of approximating a multiple-input multiple-output (MIMO) p×m rational transfer function H(s) of high degree by another p×m rational transfer function b H(s) of much smaller degree, so that the H2 norm of the approximation error is minimized. We characterize the stationary points of the H2 norm of the approximation error by tangential interpolation conditions and also ext...
متن کاملRobust H2 Filtering for Continuous Time Systems with Linear Fractional Representation
Abstract: This paper introduces a new approach to H2 robust filtering design for continuoustime LTI systems subject to linear fractional parameter uncertainty representation. The novelty consists on the determination of a performance certificate, in terms of the gap between lower and upper bounds of a minimax programming problem which defines the optimal robust equilibrium cost. The calculation...
متن کاملTruncated Linear Minimax Estimator of a Power of the Scale Parameter in a Lower- Bounded Parameter Space
Minimax estimation problems with restricted parameter space reached increasing interest within the last two decades Some authors derived minimax and admissible estimators of bounded parameters under squared error loss and scale invariant squared error loss In some truncated estimation problems the most natural estimator to be considered is the truncated version of a classic...
متن کامل4.1 Introduction 4.2 Boolean Function Evalutation Figure 4.2.1: a Depth 2k And-or Circuit
In this lecture, we will first consider the problem of boolean function evaluation and prove that randomized algorithms (in the expected case) perform better than deterministic algorithms. The boolean circuits that we consider, can be naturally extended to obtain a game tree. We will then state Von Neumann’s minimax theorem and its extension Yao’s principle. Finally, we show how Yao’s principle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 206 شماره
صفحات -
تاریخ انتشار 2016